The Distance between the Eigenvalues of Hermitian Matrices

نویسنده

  • RAJENDRA BHATIA
چکیده

It is shown that the minmax principle of Ky Fan leads to a quick simple derivation of a recent inequality of V. S. Sunder giving a lower bound for the spectral distance between two Hermitian matrices. This brings out a striking parallel between this result and an earlier known upper bound for the spectral distance due to L. Mirsky. Let A be a Hermitian matrix of order n and let A ¿(A) denote the vector in Rn whose coordinates are the eigenvalues of A arranged as A[i](A) >••'•> A[n](A). Let A(i)(A) < ■ • ■ < A(n)(A) be the increasing rearrangement of these eigenvalues and At (A) the vector with coordinates A(j)(A), j = 1,2,..., n. The same symbols Xi [A) and Af (A) will also denote the diagonal matrices which have as their diagonal entries the components of the vectors Af [A) and Af (A), respectively. Let || • || denote any unitarily invariant norm on the space of matrices. (See [4].) This note is concerned with the following result: THEOREM. Let A and B be Hermitian matrices. Then for every unitarily invariant norm we have (1) Ul(A) Aj (ß)|| < \\A B\\ < \\Xt (A) AT(5)||. The first inequality in (1) appeared in a paper of Mirsky [4], who used a famous result of Lidskii and Wielandt to derive it. The second is proved in a recent paper of Sunder [5]. I give here another proof of the second inequality which has two attractive features: It is very short and it proceeds on exactly the same lines as the well-known proof of Lidskii, Wielandt and Mirsky for the first inequality. For illumination, I indicate how both inequalities follow from the same principle. It is an easy consequence of the minmax principle of Wielandt that for any choice 1 < ix < ■ ■ ■ < ik < n of k indices we have (2) E am (A+B) < EA w w + EA w (ß) 3 = 1 3 = 1 3 = 1 for all k — 1,2,..., n, with equality holding for k = n. (See [3, p. 242].) Writing x < y to mean that the vector x is majorised by the vector y in Rn (see [3]), we get from inequalities (2) (3) Xí(A + B)-Xi(B)<Xí(A). With a change of variables, this gives _ Xi(A)-Xl{B)<Xl(A-B). Received by the editors August 27, 1984 and, in revised form, January 14, 1985. 1980 Mathematics Subject Classification. Primary 15A42, 15A57.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Computing the Matrix Geometric Mean of Two HPD Matrices: A Stable Iterative Method

A new iteration scheme for computing the sign of a matrix which has no pure imaginary eigenvalues is presented. Then, by applying a well-known identity in matrix functions theory, an algorithm for computing the geometric mean of two Hermitian positive definite matrices is constructed. Moreover, another efficient algorithm for this purpose is derived free from the computation of principal matrix...

متن کامل

Universality of the Local Spacing Distribution in Certain Ensembles of Hermitian Wigner Matrices

Abstract. Consider an N × N hermitian random matrix with independent entries, not necessarily Gaussian, a so called Wigner matrix. It has been conjectured that the local spacing distribution, i.e. the distribution of the distance between nearest neighbour eigenvalues in some part of the spectrum is, in the limit as N → ∞, the same as that of hermitian random matrices from GUE. We prove this con...

متن کامل

The structured distance to normality of banded Toeplitz matrices

Matrix nearness problems have been the focus of much research in linear algebra; see, e.g., [8,9,19,32]. In particular, characterizations of the algebraic variety of normal matrices and distance measures to this variety have received considerable attention; see [10,11,13,14,16,17,23,25–27]. Normal matrices are of interest because their eigenvalues are optimally conditioned and their singular va...

متن کامل

Lecture 5: Eigenvalues of Hermitians Matrices

This lecture takes a closer look at Hermitian matrices and at their eigenvalues. After a few generalities about Hermitian matrices, we prove a minimax and maximin characterization of their eigenvalues, known as Courant–Fischer theorem. We then derive some consequences of this characterization, such as Weyl theorem for the sum of two Hermitian matrices, an interlacing theorem for the sum of two ...

متن کامل

Convergence Properties of Hermitian and Skew Hermitian Splitting Methods

In this paper we consider the solutions of linear systems of saddle point problems‎. ‎By using the spectrum of a quadratic matrix polynomial‎, ‎we study the eigenvalues of the iterative matrix of the Hermitian and skew Hermitian splitting method‎.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010